101 research outputs found
Introducing the Concept of Activation and Blocking of Rules in the General Framework for Regulated Rewriting in Sequential Grammars
We introduce new possibilities to control the application of rules based on
the preceding application of rules which can be de ned for a general model of sequential
grammars and we show some similarities to other control mechanisms as graph-controlled
grammars and matrix grammars with and without applicability checking as well as gram-
mars with random context conditions and ordered grammars. Using both activation and
blocking of rules, in the string and in the multiset case we can show computational com-
pleteness of context-free grammars equipped with the control mechanism of activation
and blocking of rules even when using only two nonterminal symbols
A Formal Framework for Clock-free Networks of Cells
International audienceno abstrac
One-Membrane P Systems with Activation and Blocking of Rules
We introduce new possibilities to control the application of rules based on
the preceding applications, which can be de ned in a general way for (hierarchical) P
systems and the main known derivation modes. Computational completeness can be
obtained even for one-membrane P systems with non-cooperative rules and using both
activation and blocking of rules, especially for the set modes of derivation.
When we allow the application of rules to in
uence the application of rules in previous
derivation steps, applying a non-conservative semantics for what we consider to be a
derivation step, we can even \go beyond Turing"
(Tissue) P Systems with Vesicles of Multisets
We consider tissue P systems working on vesicles of multisets with the very
simple operations of insertion, deletion, and substitution of single objects.
With the whole multiset being enclosed in a vesicle, sending it to a target
cell can be indicated in those simple rules working on the multiset. As
derivation modes we consider the sequential mode, where exactly one rule is
applied in a derivation step, and the set maximal mode, where in each
derivation step a non-extendable set of rules is applied. With the set maximal
mode, computational completeness can already be obtained with tissue P systems
having a tree structure, whereas tissue P systems even with an arbitrary
communication structure are not computationally complete when working in the
sequential mode. Adding polarizations (-1, 0, 1 are sufficient) allows for
obtaining computational completeness even for tissue P systems working in the
sequential mode.Comment: In Proceedings AFL 2017, arXiv:1708.0622
Input-Driven Tissue P Automata
We introduce several variants of input-driven tissue P automata where the
rules to be applied only depend on the input symbol. Both strings and multisets are
considered as input objects; the strings are either read from an input tape or defined
by the sequence of symbols taken in, and the multisets are given in an input cell at the
beginning of a computation, enclosed in a vesicle. Additional symbols generated during a
computation are stored in this vesicle, too. An input is accepted when the vesicle reaches a
final cell and it is empty. The computational power of some variants of input-driven tissue
P automata is illustrated by examples and compared with the power of the input-driven
variants of other automata as register machines and counter automata
P Systems with Randomized Right-hand Sides of Rules
P systems are a model of hierarchically compartmentalized multiset rewriting.
We introduce a novel kind of P systems in which rules are dynamically constructed
in each step by non-deterministic pairing of left-hand and right-hand sides. We de ne
three variants of right-hand side randomization and compare each of them with the power
of conventional P systems. It turns out that all three variants enable non-cooperative P
systems to generate exponential (and thus non-semi-linear) number languages. We also
give a binary normal form for one of the variants of P systems with randomized rule
right-hand sides. Finally, we also discuss extensions of the three variants to tissue P
systems, i.e., P systems on an arbitrary graph structure
Variants of P Systems with Toxic Objects
Toxic objects have been introduced to avoid trap rules, especially in (purely)
catalytic P systems. No toxic object is allowed to stay idle during a valid derivation in a
P system with toxic objects. In this paper we consider special variants of toxic P systems
where the set of toxic objects is prede ned { either by requiring all objects to be toxic or
all catalysts to be toxic or all objects except the catalysts to be toxic. With all objects
staying inside and being toxic, purely catalytic P systems cannot go beyond the nite
sets, neither as generating nor as accepting systems. With allowing the output to be sent
to the environment, exactly the regular sets can be generated. With non-cooperative
systems with all objects being toxic we can generate exactly the Parikh sets of languages
generated by extended Lindenmayer systems. Catalytic P systems with all catalysts being
toxic can generate at least PsMAT
How to Go Beyond Turing with P Automata: Time Travels, Regular Observer !-Languages, and Partial Adult Halting
In this paper we investigate several variants of P automata having in nite
runs on nite inputs. By imposing speci c conditions on the in nite evolution of the
systems, it is easy to nd ways for going beyond Turing if we are watching the behavior
of the systems on in nite runs. As speci c variants we introduce a new halting variant for
P automata which we call partial adult halting with the meaning that a speci c prede ned
part of the P automaton does not change any more from some moment on during the
in nite run. In a more general way, we can assign !-languages as observer languages
to the in nite runs of a P automaton. Speci c variants of regular !-languages then, for
example, characterize the red-green P automata
- …